Nonsingular mixed graphs with few eigenvalues greater than two
نویسندگان
چکیده
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mixed graphs G with exactly one Laplacian eigenvalue greater than 2 are also characterized. c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most three Laplacian eigenvalues greater than two.
متن کاملSmall graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملSpectral characterization of mixed extensions of small graphs
A mixed extension of a graph G is a graph H obtained from G by replacing each vertex of G by a clique or a coclique, where vertices of H coming from different vertices of G are adjacent if and only if the original vertices are adjacent in G. If G has no more than three vertices, H has all but at most three adjacency eigenvalues equal to 0 or −1. In this paper we consider the converse problem, a...
متن کاملProperties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
The class of nonsingular connected weighted directed graphs with an unweighted undirected branch is considered in this article. This paper investigates the monotonicity properties of the first eigenvectors of such graphs along certain paths. The paper describes how the first eigenvalue of such graphs changes under some perturbation. It is shown that replacing a branch which is a tree by a path ...
متن کاملGraphs with many valencies and few eigenvalues
Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues and arbitrarily many distinct valencies. The graphs with four distinct eigenvalues come from regular two-graphs. As a side result, we characterize the disconne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007